Macro tree transducers
نویسندگان
چکیده
منابع مشابه
Macro Tree Transducers
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes. ...
متن کاملMulti-Return Macro Tree Transducers
An extension of macro tree transducers is introduced with the capability of states to return multiple trees at the same time. Under call-by-value semantics, the new model is strictly more expressive than call-by-value macro tree transducers, and moreover, it has better closure properties under composition.
متن کاملMacro Tree Transducers in Treebag
Treebag is a software for experimenting with formal models in Computer Science, one type of such models being tree transducers. Tree transducers translate input trees to output trees, a mechanism used in e.g. compilers and picture generation. The top-down tree transducer is one of the formal models implemented as a component in Treebag. Compared to the top-down tree transducer, the macro tree t...
متن کاملTowards Practical Typechecking for Macro Tree Transducers
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step toward an implementation of mtt typechecker that has a practical efficiency. Our approach is to represent an input type obtained from a backward inference as an alternating tree automaton, in a style similar to Tozawa’s X...
متن کاملRecent Results on Pebble Macro Tree Transducers
The concept of a pebble tree transducer was introduced in [MSV03] as a model for XML query languages. Another, but equivalent definition was given in [EM03]. In this paper we use this latter definition. An n-pebble tree transducer M is a finite state machine that translates input trees to output trees. In this way it computes a binary relation over trees, which is called a tree transformation. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1985
ISSN: 0022-0000
DOI: 10.1016/0022-0000(85)90066-2